Pruning Rules for Optimal Runway Sequencing
نویسندگان
چکیده
منابع مشابه
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the airport, a set of time windows in which the landing is possible, is automatically assigned to each aircraft. The objective is to maximize the minimum time elapsed between any two consecutive landings. We study the complex...
متن کاملFrom Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules
Abs t rac t At the heart of many optimizat ion procedures are powerful pruning and propagation rules. This paper presents a case study in the construction of such rules. We develop a new algor i thm, Complete Decreasing Best F i t , that finds the opt imal packing of objects into bins. The algor i thm use a branching rule based on the well known Decreasing Best Fi t approximat ion algor i thm. ...
متن کاملOptimal Pruning for Unordered
Optimal Pruning for Unordered Search is a search algorithm that enables complete search through the space of possible disjuncts at the inner level of a covering algorithm. This algorithm takes as inputs an evaluation function, e, a training set, t, and a set of specialisation operators, o. It outputs a set of operators from o that creates a classifier that maximises e with respect to t. While O...
متن کاملRunway incursion alert using knowledge rules
A runway incursion is a situation where two or more aircraft or vehicles occupy one runway simultaneously and as such create a potentially dangerous situation. We can think of many situations where two aircraft/vehicles occupy the same runway simultaneously, but do not cause a conflicting situation, e.g. two taxiing aircraft on a closed runway or a departing aircraft lining up behind a landing ...
متن کاملPruning Rules for Learning Parsimonious Context Trees
We give a novel algorithm for finding a parsimonious context tree (PCT) that best fits a given data set. PCTs extend traditional context trees by allowing context-specific grouping of the states of a context variable, also enabling skipping the variable. However, they gain statistical efficiency at the cost of computational efficiency, as the search space of PCTs is of tremendous size. We propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2018
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2016.0733